Multi-buffer simulations: Decidability and complexity
نویسندگان
چکیده
منابع مشابه
Multi-Buffer Simulations for Trace Language Inclusion
We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers before she executes them on her structure. We show that the simulation games are useful to approximate the inclusion of trace closures of languages accepted by finite-state automata, which is known to be undecidable. We st...
متن کاملComplexity, decidability and completeness
We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...
متن کاملStochastic Cellular Automata: Correlations, Decidability and Simulations
This paper introduces a simple formalism for dealing with deterministic, nondeterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is not present in usual definitions. We show that this feature allows for strictly more behaviors (for instance, number conserving stochastic cellular automata r...
متن کاملDecidability and Complexity in Automatic Monoids
We prove several complexity and decidability results for automatic monoids: (i) there exists an automatic monoid with a P-complete word problem, (ii) there exists an automatic monoid such that the firstorder theory of the corresponding Cayley-graph is not elementary decidable, and (iii) there exists an automatic monoid such that reachability in the corresponding Cayley-graph is undecidable. Mor...
متن کاملDecidability and Complexity Analysis by Basic Paramodulation
It is shown that for sets of Horn clauses saturated under basic paramodulation the word and unifiability problems are in NP, and the number of minimal unifiers is simply exponential (i). For Horn sets saturated w.r.t. a special ordering under the more restrictive inference rule of basic superposition, the word and unifiability problems are still decidable and unification is finitary (ii). These...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2018
ISSN: 0890-5401
DOI: 10.1016/j.ic.2018.09.008